Distance Distribution between Complex Network Nodes in Hyperbolic Space

نویسندگان

  • Gregorio Alanis-Lobato
  • Miguel A. Andrade-Navarro
چکیده

In the emerging field of network science, a recent model proposes that a hyperbolic geometry underlies the network representation of complex systems, shaping their topology and being responsible for their signature features: scale invariance and strong clustering. Under this model of network formation, points representing system components are placed in a hyperbolic circle and connected if the distance between them is below a certain threshold. Then the aforementioned properties come out naturally, as a direct consequence of the geometric principles of the hyperbolic space containing the network. With the aim of providing insights into the stochastic processes behind the structure of complex networks constructed with this model, the probability density for the approximate hyperbolic distance between N points, distributed quasi-uniformly at random in a disk of radius R ~ lnN, is determined in this paper, together with other density functions needed to derive this result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manifold learning and maximum likelihood estimation for hyperbolic network embedding

The Popularity-Similarity (PS) model sustains that clustering and hierarchy, properties common to most networks representing complex systems, are the result of an optimisation process in which nodes seek to form ties, not only with the most connected (popular) system components, but also with those that are similar to them. This model has a geometric interpretation in hyperbolic space, where di...

متن کامل

Preferential attachment in growing spatial networks

We obtain the degree distribution for a class of growing network models on flat and curved spaces. These models evolve by preferential attachment weighted by a function of the distance between nodes. The degree distribution of these models is similar to that of the fitness model of Bianconi and Barabási, with a fitness distribution dependent on the metric and the density of nodes. We show that ...

متن کامل

Efficient embedding of complex networks to hyperbolic space via their Laplacian

The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs betwe...

متن کامل

Hyperbolic Geometry of Complex Networks

We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conver...

متن کامل

Playing Vivaldi in Hyperbolic Space

Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. They avoid the cost of explicit measurements by placing each node in a finite coordinate space and estimating the latency between two nodes as the distance between their positions in the space. In this paper, we adapt the Vivaldi algorithm to use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Complex Systems

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2016